// 
// Copyright(c) 2009 Syntext, Inc. All Rights Reserved.
// Contact: info@syntext.com, http://www.syntext.com
// 
// This file is part of Syntext Serna XML Editor.
// 
// COMMERCIAL USAGE
// Licensees holding valid Syntext Serna commercial licenses may use this file
// in accordance with the Syntext Serna Commercial License Agreement provided
// with the software, or, alternatively, in accorance with the terms contained
// in a written agreement between you and Syntext, Inc.
// 
// GNU GENERAL PUBLIC LICENSE USAGE
// Alternatively, this file may be used under the terms of the GNU General 
// Public License versions 2.0 or 3.0 as published by the Free Software 
// Foundation and appearing in the file LICENSE.GPL included in the packaging 
// of this file. In addition, as a special exception, Syntext, Inc. gives you
// certain additional rights, which are described in the Syntext, Inc. GPL 
// Exception for Syntext Serna Free Edition, included in the file 
// GPL_EXCEPTION.txt in this package.
// 
// You should have received a copy of appropriate licenses along with this 
// package. If not, see <http://www.syntext.com/legal/>. If you are unsure
// which license is appropriate for your use, please contact the sales 
// department at sales@syntext.com.
// 
// This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
// WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
// 
/*! \file
 */

#include "common/common_defs.h"
#include "common/StringTokenizer.h"
#include "common/TreelocRep.h"

COMMON_NS_BEGIN

String TreelocRep::toString() const
{
    if (0 == treeloc_.size())
        return "<empty>";
    ulong i = 0;
    String srep;
    for (; i < (treeloc_.size() - 1); ++i) {
        srep += String::number((*this)[i]);
        srep += ' ';
    }
    srep += String::number((*this)[i]);
    return srep;
}

bool TreelocRep::fromString(const String& s)
{
    Vector<uint> v;
    v.reserve(128);
    for (StringTokenizer st(s); st; ) {
        bool isOk;
        ulong idx = st.next().toULong(&isOk);
        if (!isOk)
            return false;
        v.push_back(idx);
    }
    clear();
    for (int i = v.size() - 1; i >= 0; --i)
        (*this) += v[i];
    return true;
}

COMMON_NS_END
